Regularity theory and high order numerical methods for the (1D)-fractional Laplacian
نویسندگان
چکیده
منابع مشابه
High Order Numerical Methods for Fractional Terminal Value Problems
In this paper we present a shooting algorithm to solve fractional terminal (or boundary) value problems. We provide a convergence analysis of the numerical method, derived based upon properties of the equation being solved and without the need to impose smoothness conditions on the solution. The work is a sequel to our recent investigation where we constructed a nonpolynomial collocation method...
متن کاملRegularity for the Supercritical Fractional Laplacian with Drift
We consider the linear stationary equation defined by the fractional Laplacian with drift. In the supercritical case, wherein the dominant term is given by the drift instead of the diffusion component, we prove local regularity of solutions in Sobolev spaces employing tools from the theory of pseudo-differential operators. The regularity of solutions in the supercritical case is as expected fro...
متن کاملHigher order numerical methods for solving fractional differential equations
In this paper we introduce higher order numerical methods for solving fractional differential equations. We use two approaches to this problem. The first approach is based on a direct discretisation of the fractional differential operator: we obtain a numerical method for solving a linear fractional differential equation with order 0 < α < 1. The order of convergence of the numerical method is ...
متن کاملComparing Numerical Methods for Solving Nonlinear Fractional Order Differential Equations
This paper is a result of comparison of some available numerical methods for solving nonlinear fractional order ordinary differential equations. These methods are compared according to their computational complexity, convergence rate, and approximation error. The present study shows that when these methods are applied to nonlinear differential equations of fractional order, they have different ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2017
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3276